package leetcode;

/**
 * @author Liangyaoyun
 */
public class leetCode1 {
    public int[] twoSum(int[] nums, int target) {
        int[] res=new int[2];
        for (int i = 0; i < nums.length ; i++) {
            for (int j = 1; j < nums.length ; j++) {
                if (nums[i]+nums[j]==target&&i!=j){
                    res[0]=i;
                    res[1]=j;
                    return res;
                }
            }
        }
        return res;
    }
    
}
